On the intersection graphs associeted to posets
نویسندگان
چکیده
منابع مشابه
On cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملon cycles in intersection graphs of rings
let $r$ be a commutative ring with non-zero identity. we describe all $c_3$- and $c_4$-free intersection graph of non-trivial ideals of $r$ as well as $c_n$-free intersection graph when $r$ is a reduced ring. also, we shall describe all complete, regular and $n$-claw-free intersection graphs. finally, we shall prove that almost all artin rings $r$ have hamiltonian intersection graphs. ...
متن کاملIsoparametric Problems on Graphs and Posets Isoparametric Problems on Graphs and Posets
We consider extremal graph-theoretic problems on regular structures. The problems ask to maximize a certain parameter of the structures in question under the condition that the values of some other parameter(s) are constant. This is where the term isoparametric is taken from. The graph problems we consider are edge-isoperimetric problems, and the poset problems are dealing with the notion of Ma...
متن کاملOn grid intersection graphs
Hartman I.B.-A., I. Newman and R. Ziv, On grid intersection graphs, Discrete Mathematics 87 (1991) 41-52. A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, y,) E E if and only if segments x, and y, intersect. We prove that all planar bipartite graphs have a grid representation, a...
متن کاملPosets and planar graphs
Usually dimension should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value 1⁄2 t 1l t , thought to be between t 1 and t. We have the following two results: (a) a graph is outerplanar if and only if its dimension is at most 1⁄22l3 . This characterization of outerplanar graphs is closely related to the celebrated result of W. Schnyder...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae - General Algebra and Applications
سال: 2020
ISSN: 1509-9415,2084-0373
DOI: 10.7151/dmgaa.1322